Determination of Set-Membership Identifiability Sets
نویسندگان
چکیده
منابع مشابه
Determination of Set-Membership Identifiability Sets
This paper concerns the concept of set-membership identifiability introduced in [4]. Given a model, a set-membership identifiable set is a connected set in the parameter domain of the model such that its corresponding trajectories are distinct to trajectories arising from its complementary. For obtaining the so-called set-membership identifiable sets, we propose an algorithm based on interval a...
متن کاملSet-membership identifiability of nonlinear models and related parameter estimation properties
Identifiability guarantees that the mathematical model of a dynamic system is well defined in the sense that it maps unambiguously its parameters to the output trajectories. This paper casts identifiability in a set-membership (SM) framework and relates recently introduced properties, namely, SM-identifiability, μ-SM-identifiability, and ε-SM-identifiability, to the properties of parameter esti...
متن کاملSets within sets: the influence of set membership on numerical estimates.
Navigating the world requires attention to number; however, sets in real-world contexts are rarely homogeneous or presented in isolation, thus the task of determining what constitutes a relevant set for enumeration can be a difficult one. This contextual ambiguity increases the likelihood that irrelevant sets may bias our ability to accurately track number. In the current study, we investigated...
متن کاملOn Membership Comparable Sets
A set A is k(n) membership comparable if there is a polynomial time computable function that, given k(n) instances of A of length at most n, excludes one of the 2 k(n) possibilities for the memberships of the given strings in A. We show that if SAT is O(log n) membership comparable, then UniqueSAT 2 P. This extends the and answers in the aarmative an open question suggested by Buhrman, Fortnow,...
متن کاملSet - Membership Adaptive Equalization
This paper considers the problems of channel estimation and adaptive equalization in the novel framework of set-membership parameter estimation. Channel estimation using a class of set-membership identiication algorithms known as optimal bounding ellipsoid (OBE) algorithms and their extension to track time-varying channels are described. Simulation results show that the OBE channel estimators o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2014
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-014-0201-1